翻訳と辞書 Words near each other ・ Priority date ・ Priority Development Assistance Fund ・ Priority Development Assistance Fund scam ・ Priority Dispatching Rules ・ Priority draft pick ・ Priority effect ・ Priority encoder ・ Priority inheritance ・ Priority inversion ・ Priority level ・ Priority Material Office ・ Priority Matrix ・ Priority product ・ Priority Products and Materials report ・ Priority queue ・ Priority R-tree ・ Priority Records ・ Priority review voucher ・ Priority right ・ Priority seat ・ Priority sector lending ・ Priority signs ・ Priority Sports and Entertainment ・ Priority Telecom ・ Priority to the right ・ Prioro ・ Priors Dean ・ Priors Hardwick ・ Priors Marston ・ Priorstown Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Priority R-tree ： ウィキペディア英語版 Priority R-tree The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree. It was first proposed by Arge, De Berg, Haverkort and Yi, K. in an article from 2004. The prioritized R-tree is essentially a hybrid between a k-dimensional tree and a r-tree in that it defines a given object's N-dimensional bounding volume (called Minimum Bounding Rectangles - MBR) as a point in N-dimensions, represented by the ordered pair of the rectangles. The term ''prioritized'' arrives from the introduction of four priority-leaves that represents the most extreme values of each dimensions, included in every branch of the tree. Before answering a window-query by traversing the sub-branches, the prioritized R-tree first checks for overlap in its priority nodes. The sub-branches are traversed (and constructed) by checking whether the least value of the first dimension of the query is above the value of the sub-branches. This gives access to a quick indexation by the value of the first dimension of the bounding box. == Performance == Arge et al. writes that the priority tree always answers window-queries with $\backslash ,\; O((N\; /\; B)^\; +\; T\; /\; B)\; I/Os$, where N is the number of d-dimensional (hyper-) rectangles stored in the R-tree, B is the disk block size, and T is the output size. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Priority R-tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.